MobySpace : Mobility Pattern Space Routing for DTNs

Simulation parameters: 50 mobile nodes, 25 locations, pause time at each location is uniformly distributed on [5s,15s], nodes generate bundles every 30s toward each of the others during the first 500s, simulation time is 4000s. This work has been funded by the ANRT through a CIFRE grant, and by EuronetLab, and was conducted at the Université Pierre et Marie Curie (1) and Thales Communications (2). Problem: • Routing is a challenge in DTNs (Delay Tolerant Networks). Regular adhoc routing protocols fail because the topology suffers from connectivity disruptions. Proposition: • We propose to use mobility patterns of nodes, i.e. regularities in nodes contacts or movements, to define their position in a virtual Euclidean space used for routing. This space is called the MobySpace. • Each node’s position in the MobySpace (its MobyPoint) is flooded throughout the network. Other nodes use this information for routing. • To route a bundle, a node chooses among its physical neighbors. It passes the bundle to the neighbor whose MobyPoint is closest to the destination’s. • The MobySpace can be defined in many ways, e.g. type/number of dimensions, distance function. This poster describes preliminary work.